Revisiting Universal Grammar 1
نویسنده
چکیده
منابع مشابه
Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?
Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...
متن کاملRelationship between Iranian EFL High School Students’ Knowledge of Universal Grammar and their Performance on Standardized General English Proficiency Tests
This study investigated the relationship between Iranian high school students’ Universal Grammar knowledge and their performance on such standardized general English proficiency tests as PET and FCE internationally administered by Cambridge University. To this end, 108 students were randomly chosen from some high schools located in Malayer from Hamedan. Since this study was correlational in nat...
متن کاملThe role of Universal Grammar in second language acquisition
This paper discusses the question of whether Universal Grammar is relevant to the study of second language acquisition—in particular second language phonology. It will be shown that the notion of Universal Grammar has been hard to define coherently, which makes it difficult to implement it in second language acquisition research. One framework which offers a possibly explicit definition of Univ...
متن کاملOn the Complexity of Alignment Problems in Two Synchronous Grammar Formalisms
The alignment problem for synchronous grammars in its unrestricted form, i.e. whether for a grammar and a string pair the grammar induces an alignment of the two strings, reduces to the universal recognition problem, but restrictions may be imposed on the alignment sought, e.g. alignments may be 1 : 1, island-free or sure-possible sorted. The complexities of 15 restricted alignment problems in ...
متن کاملStudy On Universal Lossless Data Compression by using Context Dependence Multilevel Pattern Matching Grammar Transform
In this paper, the context dependence multilevel pattern matching(in short CDMPM) grammar transform is proposed; based on this grammar transform, the universal lossless data compression algorithm, CDMPM code is then developed. Moreover, it is proved that this algorithms’ worst case redundancy among all individual sequences of length n from a finite alphabet is upper bounded by ) log / 1 ( n C w...
متن کامل